Infinite Primitive Groups.
نویسندگان
چکیده
We give a complete characterization of finitely generated primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a special case Kleinian groups as well as finitely generated subgroups of word hyperbolic groups. As an application we calculate the Frattini subgroup in many of these settings. In particular, we settle a conjecture of G. Higman and B.H. Neumann on the Frattini group of an amalgamated product, and prove that the Frattini subgroup of any non-elementary convergence group is finite, generalizing a theorem of I. Kapovich.
منابع مشابه
Rings with a setwise polynomial-like condition
Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.
متن کاملSuborbits in Infinite Primitive Permutation Groups
For every infinite cardinal κ, we construct a primitive permutation group which has a finite suborbit paired with a suborbit of size κ. This answers a question of Peter M. Neumann.
متن کاملDistinguishability of Infinite Groups and Graphs
The distinguishing number of a group G acting faithfully on a set V is the least number of colors needed to color the elements of V so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its automorphism group acting on its vertex set. A connected graph Γ is said to have connectivity 1 if there exists a vertex α ...
متن کاملInfinite groups and primitivity of their group rings
we focus on a local property which is often satisfied by groups with non-abelian free subgroups: (∗) For each subset M of G consisting of finite number of elements not equal to 1, there exist three distinct elements a, b, c in G such that whenever xi ∈ {a, b, c} and (x−1 1 g1x1) · · · (x−1 m gmxm) = 1 for some gi ∈ M , xi = xi+1 for some i. We can see that the group algebra KG of a group G over...
متن کاملInfinite Bounded Permutation Groups
This work concerns permutation groups on uncountable sets. The environment is ZFC, Set Theory with Axiom of Choice. Therefore the cardinal numbers are wellordered, a cardinal number k is infinite if and only if Ko < k, and each cardinal number k has a unique successor k. Throughout the paper Cl will be a set (usually infinite), n its cardinality, and m a cardinal number less than n. The support...
متن کاملConstructing continuum many countable, primitive, unbalanced digraphs
We construct continuum many non-isomorphic countable digraphs which are highly arc-transitive, have finite out-valency and infinite in-valency, and whose automorphism groups are primitive. 2000 Mathematics Subject Classification: 20B07, 20B15, 03C50, 05C20.
متن کامل